For undirected trees, tree-depth can be computed in linear time.
2.
Andr?Joyal used this fact to provide a bijective proof of Cayley's formula, that the number of undirected trees on " n " nodes is " n " " n " & minus; 2, by finding a bijection between maximal directed pseudoforests and undirected trees with two distinguished nodes.
3.
Andr?Joyal used this fact to provide a bijective proof of Cayley's formula, that the number of undirected trees on " n " nodes is " n " " n " & minus; 2, by finding a bijection between maximal directed pseudoforests and undirected trees with two distinguished nodes.
मोबाइल